Weak coin flipping with small bias

نویسندگان

  • Iordanis Kerenidis
  • Ashwin Nayak
چکیده

This paper presents a quantum protocol that demonstrates that weak coin flipping with bias ≈ 0.239, less than 1/4, is possible. A bias of 1/4 was the smallest known, and followed from the strong coin flipping protocol of Ambainis in [33rd STOC, 2001] (also proposed by Spekkens and Rudolph [Phys. Rev. A 65 (2002) 012310]). Protocols with yet smaller bias ≈ 0.207 have independently been discovered by Ambainis (2001) and Spekkens and Rudolph [Phys. Rev. Lett. 89 (2002) 227901]. We also present an alternative strong coin flipping protocol with bias 1/4 with analysis simpler than that of Ambainis [33rd STOC, 2001].  2003 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Serial composition of quantum coin flipping and bounds on cheat detection for bit commitment

Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in th...

متن کامل

A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias

God does not play dice. He flips coins instead.” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kita...

متن کامل

Quantum coin flipping with arbitrary small bias is impossible

Lo and Chau [7] showed that ideal quantum coin flipping protocol is impossible. The proof was simply derived from the impossibility proof of quantum bit commitment [7, 8]. However, the proof still leaves the possibility of quantum coin flipping protocol with arbitrary small bias. In this paper, we show that quantum coin flipping protocol with arbitrary small bias is impossible and show the lowe...

متن کامل

Large family of quantum weak coin-flipping protocols

Each classical public-coin protocol for coin flipping is naturally associated with a quantum protocol for weak coin flipping. The quantum protocol is obtained by replacing classical randomness with quantum entanglement and by adding a cheat detection test in the last round that verifies the integrity of this entanglement. The set of such protocols defines a family which contains the protocol wi...

متن کامل

Lower bound for a class of weak quantum coin flipping protocols

We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (quant-ph/0202118). We show that, for any protocol in this class, one party can win the coin flip with probability at least 1/ √

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 89  شماره 

صفحات  -

تاریخ انتشار 2004